Introduction to graph minors and treewidth
نویسنده
چکیده
3 Treewidth 12 3.1 Definition and basic properties . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 Recursively defined graph classes . . . . . . . . . . . . . . . . . . . . . . . 14 3.3 Chordal graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.4 Search games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.5 Separators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 3.6 Brambles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.7 Treewidth and the minor theorem . . . . . . . . . . . . . . . . . . . . . . . 23
منابع مشابه
Degree-Based Treewidth Lower Bounds
Every lower bound for treewidth can be extended by taking the maximum of the lower bound over all subgraphs or minors. This extension is shown to be a very vital idea for improving treewidth lower bounds. In this paper, we investigate a total of nine graph parameters, providing lower bounds for treewidth. The parameters have in common that they all are the vertex-degree of some vertex in a subg...
متن کاملBidimensionality, Map Graphs, and Grid Minors
In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs. In both cases we prove a polynomial relation between the treewidth of a graph in the family and the size of the largest grid minor. These bounds improve the running times of a broad class of fixed-parameter algorithms. Our novel technique of using appro...
متن کاملTreewidth: Algorithmic techniques and results
This paper gives an overview of several results and techniques for graphs algorithms that compute the treewidth of a graph or that solve otherwise intractable problems when restricted graphs with bounded treewidth more e ciently. Also, several results on graph minors are reviewed.
متن کاملTreewidth: Algorithmoc Techniques and Results
This paper gives an overview of several results and techniques for graphs algorithms that compute the treewidth of a graph or that solve otherwise intractable problems when restricted graphs with bounded treewidth more eeciently. Also, several results on graph minors are reviewed.
متن کاملGraph minors, decompositions and algorithms
3 Treewidth 13 3.1 Definition and basic properties . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2 Recursively defined graph classes . . . . . . . . . . . . . . . . . . . . . . . 15 3.3 Chordal graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.4 Search games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 3.5 Separators . . . . . . . ....
متن کامل